295A - Greg and Array - CodeForces Solution

import sys 
import math
from functools import cmp_to_key
from collections import OrderedDict
 
 
sys.setrecursionlimit(10**9)
 
 
query = [0 for i in range(int(1e5 + 10))]
diff = [0 for i in range(int(1e5 + 10))]
 
 
def solve():

    n,m,k = list(map(int,input().split()))

    arr = [int(x) for x in input().split()]

    operations = []

    for i in range(m):
        temp = [int(x) for x in input().split()]
        operations.append(temp)


    for i in range(k):
        l,r = list(map(int,input().split()))

        query[l-1] += 1 
        query[r] += -1

    for i in range(1,100001):
        query[i] += query[i-1]


    for i in range(m):

        diff[operations[i][0]-1] += query[i]*operations[i][2]
        diff[operations[i][1]] -= query[i]*operations[i][2]

    for i in range(1,len(diff)):
        diff[i] += diff[i-1]


    for i in range(n):

        arr[i] = arr[i] + diff[i]
        print(arr[i],end = " ")

    print()


 
if __name__ == '__main__':
 
 
    solve()